When does a random Robin Hood win?GASARCH, William; GOLUB, Evan; SRINIVASAN, Aravind et al.Theoretical computer science. 2003, Vol 304, Num 1-3, pp 477-484, issn 0304-3975, 8 p.Article

Some connections between bounded query classes and non-uniform complexityAMIR, Amihood; BEIGEL, Richard; GASARCH, William et al.Information and computation (Print). 2003, Vol 186, Num 1, pp 104-139, issn 0890-5401, 36 p.Article

Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance ProblemsAMBAINIS, Andris; GASARCH, William; SRINIVASAN, Aravind et al.Lecture notes in computer science. 2006, pp 628-637, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

The multiparty communication complexity of exact-T : Improved bounds and new problemsBEIGEL, Richard; GASARCH, William; GLENN, James et al.Lecture notes in computer science. 2006, pp 146-156, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 11 p.Conference Paper

The complexity of learning SUBSEQ(A)FENNER, Stephen; GASARCH, William.Lecture notes in computer science. 2006, pp 109-123, issn 0302-9743, isbn 3-540-46649-5, 1Vol, 15 p.Conference Paper